Browsing by Subject "Processor failures"
Now showing items 1-1 of 1
-
Article
Efficient gossip and robust distributed computation
(2005)This paper presents an efficient deterministic gossip algorithm for p synchronous, crash-prone, message-passing processors. The algorithm has time complexity T=O(log2p) and message complexity M=O(p1+ε), for any ε>0. This ...